Detector and Method for Estimating Data Probability in a Multi-Channel Receiver

ABSTRACT

A detector and method for estimating channel data probability in a multi-user or multiple-input multiple-output communication system includes summing conditional bit probabilities conditioned on hypothetical channel data patterns over stochastically selected hypothetical channel data patterns. Various detailed hardware structures and circuits are also described.

This application is a continuation of U.S. application Ser. No. 11/177,938 filed on 7 Jul. 2005, currently pending, which claims the benefit of U.S. Application No. 60/586,360 filed on 7 Jul. 2004, each of which is incorporated by reference herein.

This invention was made with government support under NSF Grant # ECS0121389 awarded by the National Science Foundation. The Government has certain rights to this invention.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates generally to wireless communication. More particularly, the present invention relates to techniques for joint detection of multiple-input multiple-output (MIMO) and multi-user code division multiple access (CDMA) signals.

2. Related Art

Wireless communications have become ubiquitous. Improving the performance and capacity of wireless communications systems is highly desirable.

Many wireless communications systems make use of code division multiple access (CDMA) to enable multiple users to share a common frequency bandwidth. CDMA can provide high capacity in certain wireless systems, for example cellular networks. In CDMA, users' transmissions are encoded with spreading codes. Ideally, spreading codes for different users allow the transmissions for different users to be separated without interference. In practice, some interference (“multi-user interference”) occurs, which can be eliminated by various multi-user detection algorithms known in the art, including interference cancellation. Performance of interference cancellers has sometimes provided limited performance, in part due to errors in estimating the interference caused between users.

Improved interference cancellation techniques have been developed that use iterative processing. The typical iterative approach uses the output of the interference canceller to estimate user data symbols, which are fed back into the interference canceller to provide improved cancellation of interference and successively refined estimates of the user symbols. This typical approach, however, suffers from various problems, including no guarantee of convergence, and suboptimal performance. Other known approaches frequently realize only a fraction of the potential channel capacity.

An alternate approach to dealing with multi-user interference is to perform joint demodulation of the multiple users. For example, maximum likelihood sequence estimation (MLSE) may be performed which accounts for both multi-user interference and symbol-to-symbol memory introduced by forward error correction (FEC) encoding. Although MLSE can provide excellent performance, MLSE is prohibitively complex when there are a large numbers of users since the complexity of MLSE grows exponentially with the number of users. One method that avoids this exponential complexity, yet results in the same performance as MLSE is minimum mean square error (MMSE) detector with soft cancellation of X. Wang and H. V. Poor, “Iterative (Turbo) Soft Interference Cancellation and Decoding for Coded CDMA”, IEEE Trans. Commun., vol. 47, no. 7, pp. 1046-1061, July 1999. A Kuser system may in general require inversion of a K-by-K matrix for each user symbol and for each iteration. Hence, the processing complexity of suboptimum receivers can be of the order of K³. Although some simplification of the processing can be obtained using iterative steps, such approaches still require processing complexity of the order of K² or greater per each user symbol for each iteration. Hence industry has continued to search for improved multi-user detection techniques.

New wireless communications techniques, such as multiple-input multiple-output (MIMO) are also being introduced which have the potential to provide high capacity. In MIMO, multiple antennas at a transmitter are used, where different symbols may be transmitted on each antenna, providing increased capacity. Multiple antennas at the receiver are typically required, to allow the separation of the symbols from each transmit antenna. Theoretically, MIMO channels can provide capacity which increases linearly with the number of antennas, but like CDMA, interference between the different symbols from different antennas sets limits on practical application. Hence, handling interference becomes an important aspect of achieving the potential capacity of a MIMO system.

SUMMARY OF THE INVENTION

It has been recognized that it would be advantageous to develop a technique that provides good performance in the presence of multi-channel interference such as that present in CDMA and MIMO systems.

The invention includes a method for estimating channel data bit probabilities of a multi-channel signal received through a communication channel. The method may include summing a conditional bit probability to obtain a channel data bit probability summation. The conditional bit probability may be conditioned on an observation of the multi-channel signal and a hypothetical channel data pattern. The summation may be performed over a subset of hypothetical channel data patterns. The method may include selecting the hypothetical channel data patterns using a Markov chain Monte Carlo simulation to stochastically select the subset of hypothetical channel data patterns. The hypothetical channel data patterns may be selected to correspond to dominant conditional bit probability terms in the channel data bit probability summation.

Additional features and advantages of the invention will be apparent from the detailed description which follows, taken in conjunction with the accompanying drawings, which together illustrate, by way of example, features of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is flow chart of a method for estimating channel data bit probabilities of a multi-channel signal received through a communication channel in accordance with an embodiment of the present invention;

FIG. 2 is a flow chart of an alternate method for estimating channel data probabilities in a multi-channel communication system receiver in accordance with an embodiment of the present invention;

FIG. 3 is transition diagram of a Markov chain for a three-channel system in accordance with an embodiment of the present invention;

FIG. 4 is a block diagram of a multi-channel receiver in accordance with an embodiment of the present invention;

FIG. 5 is a block diagram of a detector for estimating channel data probabilities in a multi-channel communication system in accordance with an embodiment of the present invention;

FIG. 6 is a block diagram of a Gibbs sampler circuit in accordance with an embodiment of the present invention;

FIG. 7 is a circuit diagram of a ψ-calculator circuit in accordance with an embodiment of the present invention;

FIG. 8 is a circuit diagram of a ξ-calculator circuit in accordance with an embodiment of the present invention; and

FIG. 9 is a circuit diagram of a log-likelihood calculator circuit in accordance with an embodiment of the present invention.

DETAILED DESCRIPTION

Reference will now be made to the exemplary embodiments illustrated in the drawings, and specific language will be used herein to describe the same. It will nevertheless be understood that no limitation of the scope of the invention is thereby intended. Alterations and further modifications of the inventive features illustrated herein, and additional applications of the principles of the inventions as illustrated herein, which would occur to one skilled in the relevant art and having possession of this disclosure, are to be considered within the scope of the invention.

The following notations are adhered to throughout this application. Vectors are denoted by lowercase bold letters. Matrices are denoted by uppercase bold letters. The ij-th element of a matrix, say, A is denoted by a_(ij). The superscripts ^(T) and ^(H) are used to denote matrix or vector transpose and Hermitian, respectively. Integer subscripts are used to distinguish different channels. Integer time indices are put in brackets. For example, d_(k)(i) is used to denote the ith symbol of the channel k. In most expressions, the time index, i, is omitted for brevity. The notations P(•) and p(•) denote the probability of a discrete random variable and the probability density of a continuous random variable, respectively.

One aspect of the presently disclosed inventive techniques involves recognizing that a MIMO communication system resembles a CDMA system. The data streams transmitted at each MIMO antenna are thus analogous to users in a CDMA system, and the channel gains between each transmit antenna and the receive antennas is a vector analogous to a spreading codes of a CDMA user. Accordingly, the number of receive antennas plays the same role as the spreading gain, N, in a multi-user system, and the number of transmit antennas plays the same role as the number of users, K. Hence, the methods developed for multi-user detection can be immediately applied to a MIMO system with K transmit and N receive antennas. K/N can thus be referred to as the system load, and the MIMO channel is thus under-loaded when K<N, fully loaded when K=N, and over-loaded when K>N. Accordingly, throughout this application the term multi-channel will thus be used in a general sense to refer to both CDMA and MIMO systems. Within a multi-user CDMA system, for example where individual users are each encoded with a different spreading code, the term channel refers to an individual user within a composite CDMA signal. Within a MIMO system, for example where different data streams are transmitted by transmit antennae, the term channel refers to a particular data stream transmitted on one antenna; such a channel may correspond to one or more users. Of course, variations on these basic types of systems will occur to one of skill in the art, and combinations of CDMA and MIMO techniques are also known to which the disclosed inventive techniques are equally applicable.

A multi-channel CDMA or MIMO communication system with K channels will now be described in general terms. For simplicity, it is assumed that the channels are synchronous, although this is not be essential. Each channel has a spreading sequences of length N, i.e., a spreading gain of N. Using d(i)=[d₁(i)d₂(i) . . . d_(K)(i)]^(T) to denote data symbols transmitted by the K channels in the i^(th) time slot and A(i) to denote the matrix containing spreading code (scaled with the channel gain) of the k^(th) channel in its k^(th) column, the received signal vector, is given by

y(i)=A(i)d(i)+n(i)  (1)

where n(i) is the channel additive noise. The received signal may be sampled at a chip rate, or another convenient rate as will occur to one of skill in the art.

For simplicity, it is assumed in the derivation that the samples of n(i) are zero-mean, independent, and identically distributed and E[n(i)n^(H)(i)]=σ_(n) ²I. In practice, noise frequently deviates slightly from this assumption without substantially degrading the performance of communication systems. Data symbols are transmitted and decoded in blocks of length M and for each block the time index i takes the values of 1 to M. Various block sizes will be suitable depending upon the communication system application.

As most receivers include forward error correction decoding, an estimate of the data log-likelihood ratio (LLR) is used, given by

$\begin{matrix} {{{\lambda_{1}\left( {d_{k}(i)} \right)} = {\ln \frac{P\left( {{{d_{k}(i)} = \left. {+ 1} \middle| {y(i)} \right.},{\lambda_{2}^{e}(i)}} \right)}{P\left( {{{d_{k}(i)} = \left. {- 1} \middle| {y(i)} \right.},{\lambda_{2}^{e}(i)}} \right)}}},} & (2) \end{matrix}$

where λ₂ ^(e)(i) is extrinsic information provided by a forward error correction decoder, when present, as discussed further below. Estimating the values of λ₁(d_(k)(i)) in a computationally efficient manner is a significant benefit of the presently disclosed inventive techniques. For example, note that

$\begin{matrix} \begin{matrix} {P\left( {{d_{k}(i)} = \left. {+ 1} \middle| {y(i)} \right.} \right)} \\ {= {\sum\limits_{d_{- k}{(i)}}{P\left( {{{d_{k}(i)} = {+ 1}},\left. {d_{- k}(i)} \middle| {y(i)} \right.} \right)}}} \\ {{= {\sum\limits_{d_{- k}{(i)}}{{P\left( {{{d_{k}(i)} = \left. {+ 1} \middle| {y(i)} \right.},{d_{- k}(i)}} \right)}{P\left( {d_{- k}(i)} \middle| {y(i)} \right)}}}},} \end{matrix} & (4) \end{matrix}$

where the second identity follows by applying the chain rule, d_(−k)(i)=[d₁(i) . . . d_(k−1)(i) d_(k+1)(i) . . . d_(K)(i)]^(T) and the summation is over all possible values of d_(−k)(i). The number of combinations that d_(−k)(i) can take grows exponentially with K and thus becomes prohibitive for large values of K.

A first method which can avoid this prohibitive complexity will now be described. FIG. 1 illustrates a flow chart of a method, shown generally at 100, for estimating a channel data bit probability, e.g. P(d_(k)(i)=+1|y(i)), of a multi-channel signal received through a communication channel. The method includes summing 102 a conditional bit probability, e.g. P(d_(k)(i)=+1|y(i),d_(−k)(i)), conditioned on an observation of the multi-channel signal, e.g. y(i), and a hypothetical data pattern, e.g. d_(−k)(i) to obtain a channel data bit probability summation. Rather than summing the conditional bit probability over all possible data patterns, the summation is performed over a subset of the hypothetical data patterns, e.g. d_(−k)(i). Hence, the method includes selecting 104 the subset of data patterns corresponding to dominant conditional bit probability terms in the channel data bit probability summation. In other words, the summation is performed substantially over terms where the conditional probability is significant, and terms where the conditional probability is significant are substantially omitted.

The selection of hypothetical channel data patterns can be performed using a Markov chain Monte Carlo (MCMC) simulation to stochastically select the subset of data patterns corresponding to dominant conditional bit probability terms in the channel data bit probability summation. By summing a subset of data patterns corresponding to the dominant terms, rather than summing over all possible data values, a significant reduction in the processing can be obtained relative to an exact calculation of the channel data bit probability summation. The MCMC simulation helps to ensure that the subset of data patterns selected correspond to the dominant terms. Dominant terms are those terms in the summation that are relatively large and thus have correspondingly greater impact on the summation than terms that are relatively small. A significant benefit of the method is the ability to obtain an accurate estimate of the channel data bit probability from a relatively small subset of hypothetical channel data patterns, by including primarily dominant terms in the summation. An additional benefit of the method is improved accuracy of the channel data probability estimates relative to some prior art approaches which do not perform probability summations.

Of course, because the conditional probability summation can be normalized, it is not essential that all of the dominant terms are included, or that all non-dominant terms are excluded, in order to obtain a good estimate of the channel data bit probability. The MCMC simulation, being a stochastic process, will not precisely select all the largest terms and exclude all the smallest terms. Instead, the MCMC simulation helps to ensure that most of the hypothetical data patterns included in the summation are dominant terms.

In order to describe in further detail how the MCMC simulation may be used to select dominant conditional bit probability terms, a general description of Bayesian estimation using Monte Carlo integration will be provided. Consider the problem of evaluating the weighted mean of a function h(x) of a random variable X, given a weighting function f(x), viz.

E _(f) [h(X)]=∫_(x) h(x)f(x)dx,  (5)

where x is the domain of X and f(•) is a proper density function, i.e., f(x)≧0 for x∈T and ∫_(x)f(x)dx=1. An estimate of (5) can be obtained by evaluating the empirical average

$\begin{matrix} {{\overset{\_}{h} = {\frac{1}{N_{s}}{\sum\limits_{n = 1}^{N_{s}}{h\left( x_{n} \right)}}}},} & (6) \end{matrix}$

where x_(n)'s are samples from the distribution f(x). Moreover, the speed of convergence of the method can be evaluated by estimating the variance of h which can be obtained by

$\begin{matrix} {\sigma_{\overset{\_}{h}}^{2} = {\frac{1}{N_{s}\left( {N_{s} - 1} \right)}{\sum\limits_{n = 1}^{N_{s}}{{{{h\left( x_{n} \right)} - \overset{\_}{h}}}^{2}.}}}} & (7) \end{matrix}$

Here, x may be a scalar or a vector variable. When x is a vector, the integral in (5) is a multiple integral whose direct computation may become prohibitive as the dimension of x increases. From (7), the accuracy of the estimate (6) reduces with the square of the number of sample points. Moreover, numerical studies show that the dimension of x and the size N, are very weakly related in the sense that even though the dimension of x may increase, the order of magnitude of N, remains unchanged. Hence, by using a MCMC simulation to select hypothetical data patterns in the channel data probability summation, the exponential growth of computational complexity that is commonly encountered in performing multiple integrals may be avoided.

The Monte Carlo integration include importance sampling. In the method of importance sampling E_(f)[h(X)] is evaluated by performing the empirical average

$\begin{matrix} {{{E_{f}\left\lbrack {h(X)} \right\rbrack} \approx {\frac{1}{N_{s}}{\sum\limits_{n = 1}^{N_{s}}{\frac{f\left( x_{n} \right)}{f_{a}\left( x_{n} \right)}{h\left( x_{n} \right)}}}}},} & (8) \end{matrix}$

where the samples x_(n) are chosen from the auxiliary distribution f_(a)(x). Equation (8) follows from the alternative representation of (5)

$\begin{matrix} {{E_{f}\left\lbrack {h(X)} \right\rbrack} = {\int_{X}{{h(x)}\frac{f(x)}{f_{a}(x)}{f_{a}(x)}\ {x}}}} & (9) \end{matrix}$

and performing the integral using Monte Carlo integration based on the distribution f_(a)(x). Similar to f(x), f_(a)(x) is preferably a proper density function, i.e., it satisfies the conditions f_(a)(x)≧0 for x∈X and ∫_(X)f_(a)(x)dx=1. When f_(a)(x)=f(x), (8) reduces to regular Monte Carlo integration.

It turns out that, for a fixed value of N_(s), many choices of f_(a)(x) that are different from f(x) may result in more accurate evaluation of E_(f)[h(x)]. In particular, one auxiliary distribution f_(a)(x) that allows accurate evaluation of E_(f)[h(x)] with minimum number of samples is f_(a,o)(x)=|h(x)|f(x)/∫_(X)|h(x)|f(x)dx. When available, this auxiliary distribution allows exact evaluation of E_(f)[h(x)] by using a single sample. However, f_(a,o)(x) depends on the integral ∫_(X)|h(x)|f(x)dx which may not be available. In fact, when h(x)>0 for x∈X, the latter is the integral seeking to be solved. A practical approximation that has been motivated from importance sampling which usually results in a better approximation than (8) is

$\begin{matrix} {{\overset{\_}{h} = \frac{\sum\limits_{n = 1}^{N_{s}}{\frac{f\left( x_{n} \right)}{f_{a}\left( x_{n} \right)}{h\left( x_{n} \right)}}}{\sum\limits_{n = 1}^{N_{s}}\frac{f\left( x_{n} \right)}{f_{a}\left( x_{n} \right)}}},} & (10) \end{matrix}$

where here also, x_(n) is chosen from the distribution f_(a)(x). A special case of (10), of particular interest, is obtained when f_(a)(x) is uniform over a selected range of x. In order to minimize N_(s), this range is chosen such that it covers the values of x for which f(x)h(x) is significant. In other words, x is limited to the important samples that contribute to the desired integral. When f_(a)(x) is uniform, (10) simplifies to

$\begin{matrix} {\overset{\_}{h} = {\frac{\sum\limits_{n = 1}^{N_{s}}{{f\left( x_{n} \right)}{h\left( x_{n} \right)}}}{\sum\limits_{n = 1}^{N_{s}}{f\left( x_{n} \right)}}.}} & (11) \end{matrix}$

Other auxiliary distribution can be used as well, as discussed further herein. For a general description of Monte Carlo methods, see G. Fishman, Monte Carlo: concepts, algorithms and applications, New York: Springer-Verlag, 1996 and C. P. Robert and G. Casella, Monte Carlo Statistical Methods: Springer-Verlag, New York, 1999.

So, to perform the summation of (4), the MCMC simulation is used to select a subset of terms. For simplicity in notation, the time index ‘i’ is dropped from all the involved variables, e.g., P(d_(k)|y) is a short-hand notation for P(d_(k)(i)|y(i)).

As discussed further below, it may be desirable to incorporate additional information into the conditional bit probability. For example, extrinsic information from a forward error correction decoder may be used to improve the LLR. If such extrinsic information is given by λ₂ ^(e), the channel data bit probability summation can be expressed as

$\begin{matrix} \begin{matrix} {P\left( {{{d_{k}(i)} = \left. {+ 1} \middle| {y(i)} \right.},{\lambda_{2}^{e}(i)}} \right)} \\ {= {\sum\limits_{d_{- k}{(i)}}{P\left( {{{d_{k}(i)} = {+ 1}},\left. {d_{- k}(i)} \middle| {y(i)} \right.,{\lambda_{2}^{e}(i)}} \right)}}} \\ {{= {\sum\limits_{d_{- k}{(i)}}{P\left( {{{d_{k}(i)} = \left. {+ 1} \middle| {y(i)} \right.},{d_{- k}(i)},{\lambda_{2}^{e}(i)}} \right)}}},} \\ {{\left. {\lambda_{2}^{e}(i)} \right){P\left( {\left. {d_{- k}(i)} \middle| {y(i)} \right.,{\lambda_{2}^{e}(i)}} \right)}},} \end{matrix} & (12) \end{matrix}$

This formulation will be used in the following derivations, although one of skill in the art will understand that the presently disclosed inventive techniques can also be applied in the absence of extrinsic information from a forward error correction decoder.

In the subsequent equations the time index “i” is not included for brevity of the presentation.

To obtain a summation similar to (6) for computation of P(d_(k)=+1|y,λ₂ ^(e)), P(d_(−k)|y,λ₂ ^(e)) is used as the density function, f(x), and P(d_(k)=+1|y,d_(−k),λ₂ ^(e)) is used as the function whose weighted sum is to be obtained, h(x). An estimate of P(d_(k)=+1|y,λ₂ ^(e)) is thus obtained by evaluating the empirical average

$\begin{matrix} {{{P\left( {{d_{k} = \left. {+ 1} \middle| y \right.},\lambda_{2}^{e}} \right)} \approx {\frac{1}{N_{s}}{\sum\limits_{n = 1}^{N_{s}}{P\left( {{d_{k} = \left. {+ 1} \middle| y \right.},d_{- k}^{(n)},\lambda_{2}^{e}} \right)}}}},} & (13) \end{matrix}$

where d_(−k) ^((n)) are the samples that are chosen from the distribution P(d_(−k)|y,λ₂ ^(e)), and, when appearing in equations like (13), d_(−k) ^((n) is the shorthand notation for d) _(−k)=d_(−k) ^((n)).

Starting with (11), treat P(d_(−k)|y,λ₂ ^(e)) as f(x),and P(d_(k)=+1|y,d_(−k),λ₂ ^(e)) as h(x). This gives

$\begin{matrix} {{{P\left( {{d_{k} = \left. {+ 1} \middle| y \right.},\lambda_{2}^{e}} \right)} \approx \frac{\sum\limits_{n = 1}^{N_{s}}{{P\left( {{d_{k} = \left. {+ 1} \middle| y \right.},d_{- k}^{(n)},\lambda_{2}^{c}} \right)}{P\left( {\left. d_{- k}^{(n)} \middle| y \right.,\lambda_{2}^{e}} \right)}}}{\sum\limits_{n = 1}^{N_{s}}{P\left( {\left. d_{- k}^{(n)} \middle| y \right.,\lambda_{2}^{e}} \right)}}},} & (14) \end{matrix}$

where the samples d_(−k) ^((n)) are chosen from a uniform distribution.

Equations (13) and (14) thus present alternate approaches to estimating the channel data bit probabilities; equation (13) using an auxiliary distribution set equal to a conditional channel data bit probability, and equation (14) using a uniform distribution. Various auxiliary distributions may be chosen, as will become apparent to one of skill in the art and having possession of this disclosure.

In accordance with one embodiment of the present invention, using the computation based on (13), P(d_(k)=+1|y,d_(−k) ^((n)),λ₂ ^(e)) is evaluated for n=1, 2, . . . , N_(s). For this, the LLR is defined as

$\begin{matrix} {{\lambda_{1}^{(n)}\left( d_{k} \right)} = {\ln \frac{P\left( {{d_{k} = \left. {+ 1} \middle| y \right.},d_{- k}^{(n)},\lambda_{2}^{e}} \right)}{P\left( {{d_{k} = \left. {- 1} \middle| y \right.},d_{- k}^{(n)},\lambda_{2}^{e}} \right)}}} & (16) \end{matrix}$

and can be expanded as

$\begin{matrix} \begin{matrix} {{\lambda_{1}^{(n)}\left( d_{k} \right)} = {\ln \frac{{p\left( {\left. y \middle| d_{- k}^{(n)} \right.,{d_{k} = {+ 1}}} \right)}{P\left( {d_{- k}^{(n)},{d_{k} = \left. {+ 1} \middle| \lambda_{2}^{e} \right.}} \right)}}{{p\left( {\left. y \middle| d_{- k}^{(n)} \right.,{d_{k} = {- 1}}} \right)}{P\left( {d_{- k}^{(n)},{d_{k} = \left. {- 1} \middle| \lambda_{2}^{e} \right.}} \right)}}}} \\ {= {{\ln \frac{p\left( {\left. y \middle| d_{- k}^{(n)} \right.,{d_{k} = {+ 1}}} \right)}{p\left( {\left. y \middle| d_{- k}^{(n)} \right.,{d_{k} = {- 1}}} \right)}} + {\lambda_{2}^{e}\left( d_{k} \right)}}} \\ {= {{\frac{1}{2\; \sigma_{n}^{2}}\left( \left| {y - {A_{- k}d_{- k}} + a_{k}} \middle| {}_{2}{- \left| {y - {A_{- k}d_{- k}} - a_{k}} \right|^{2}} \right. \right)} +}} \\ {{\lambda_{2}^{e}\left( d_{k} \right)}} \\ {= {{\frac{2}{\sigma_{n}^{2}}\left\{ {a_{k}^{H}\left( {y - {A_{- k}d_{- k}}} \right)} \right\}} + {\lambda_{2}^{e}\left( d_{k} \right)}}} \\ {= {{\frac{2}{\sigma_{n}^{2}}\left\{ {y_{k}^{MF} - {\sum\limits_{\underset{l \neq k}{l = 0}}^{K}{\rho_{kl}d_{l}}}} \right\}} + {\lambda_{2}^{e}\left( d_{k} \right)}}} \end{matrix} & (17) \end{matrix}$

where

{•} denotes the real part, A_(−k) is A with its kth column, a_(k), removed, y_(k) ^(MF)=a_(k) ^(H)y is the matched filter output for the k^(th) channel and ρ_(kl)=a_(k) ^(H)a_(l) is the crosscorrelation between channels k and l. The simplification of the second line follows when the extrinsic information provided by each element of λ₂ ^(e) is independent of those provided by its other elements, for example when there is interleaving as discussed below. If the elements of d are independent of one another this implies that

$\begin{matrix} \begin{matrix} {{\ln \frac{P\left( {d_{- k}^{(n)},{d_{k} = \left. {+ 1} \middle| \lambda_{2}^{e} \right.}} \right)}{P\left( {d_{- k}^{(n)},{d_{k} = \left. {- 1} \middle| \lambda_{2}^{e} \right.}} \right)}} = {{\ln \frac{P\left( d_{- k}^{(n)} \middle| \lambda_{2,{- k}}^{e} \right)}{P\left( d_{- k}^{(n)} \middle| \lambda_{2,{- k}}^{e} \right)}} +}} \\ {{\ln \frac{P\left( {d_{k} = \left. {+ 1} \middle| {\lambda_{2}^{e}\left( d_{k} \right)} \right.} \right)}{P\left( {d_{k} = \left. {- 1} \middle| {\lambda_{2}^{e}\left( d_{k} \right)} \right.} \right)}}} \\ {= {\ln \frac{P\left( {d_{k} = \left. {+ 1} \middle| {\lambda_{2}^{e}\left( d_{k} \right)} \right.} \right)}{P\left( {d_{k} = \left. {- 1} \middle| {\lambda_{2}^{e}\left( d_{k} \right)} \right.} \right)}}} \\ {{= {\lambda_{2}^{e}\left( d_{k} \right)}},} \end{matrix} & (18) \end{matrix}$

where λ_(2,−k) ^(e) is λ₂ ^(e) with λ₂ ^(e)(d_(k)) dropped from it and the last identity follows from the definition of L-value. The third line in (17) follows since

${{p\left( y \middle| d \right)} = {\frac{1}{\left( {2\; \pi \; \sigma_{n}^{2}} \right)^{N/2}}^{{{- {{y - {Ad}}}^{2}}/2}\; \sigma_{n}^{2}}}},$

where |•| denotes the length of a vector. Once λ₁ ^((n))(d_(k)) is obtained, recalling that P(d_(k)=−1|y,d_(−k) ^((n)),λ₂ ^(e))=1−P(d_(k)=+1|y,d_(−k) ^((n)),λ₂ ^(e)) and solving (16) for P(d_(k)=+1|y,d_(−k) ^((n)),λ₂ ^(e)),

$\begin{matrix} {{P\left( {{d_{k} = \left. {+ 1} \middle| y \right.},d_{- k}^{(n)},\lambda_{2}^{e}} \right)} = {\frac{1}{1 + {\exp \left( {- {\lambda_{1}^{(n)}\left( d_{k} \right)}} \right)}}.}} & (19) \end{matrix}$

This is used in (13) for computation P(d_(k)=+1|y,λ₂ ^(e)). Next, form the LLR by calculating

${\lambda_{1}\left( d_{k} \right)} = {\ln {\frac{P\left( {{d_{k} = \left. {+ 1} \middle| y \right.},\lambda_{2}^{e}} \right)}{1 - {P\left( {{d_{k} = \left. {+ 1} \middle| y \right.},\lambda_{2}^{e}} \right)}}.}}$

If desired, extrinsic LLR information λ₁ ^(e)(dk) may be derived from

λ₁ ^(e)(d _(k))=λ₁(d _(k))−λ₂ ^(e)(d _(k)).  (15)

For example, extrinsic LLR information may be exchanged with a forward error correction decoder as discussed further below.

In accordance with another embodiment of the present invention, using computation based on (14), the LLR can be estimated from

$\begin{matrix} {{\lambda_{1}\left( d_{k} \right)} = {\ln {\frac{P\left( {{d_{k} = \left. {+ 1} \middle| y \right.},\lambda_{2}^{e}} \right)}{P\left( {{d_{k} = \left. {- 1} \middle| y \right.},\lambda_{2}^{e}} \right)}.}}} & (20) \end{matrix}$

Substituting (14) and its dual when d_(k)=−1 in (20), yields

$\begin{matrix} {{\lambda_{1}\left( d_{k} \right)} = {\ln {\frac{\sum\limits_{n = 1}^{N_{s}}{{P\left( {{d_{k} = \left. {+ 1} \middle| y \right.},d_{- k}^{(n)},\lambda_{2}^{e}} \right)}{P\left( {\left. d_{- k}^{(n)} \middle| y \right.,\lambda_{2}^{e}} \right)}}}{\sum\limits_{n = 1}^{N_{s}}{{P\left( {{d_{k} = \left. {- 1} \middle| y \right.},d_{- k}^{(n)},\lambda_{2}^{e}} \right)}{P\left( {\left. d_{- k}^{(n)} \middle| y \right.,\lambda_{2}^{e}} \right)}}}.}}} & (21) \end{matrix}$

Using the Bayes rule,

$\begin{matrix} \begin{matrix} {{P\left( {\left. d_{- k}^{(n)} \middle| y \right.,\lambda_{2}^{e}} \right)} = \frac{p\left( {d_{- k}^{(n)},\left. y \middle| \lambda_{2}^{e} \right.} \right)}{p\left( y \middle| \lambda_{2}^{e} \right)}} \\ {= \frac{{p\left( {\left. y \middle| d_{- k}^{(n)} \right.,\lambda_{2}^{e}} \right)}{P^{e}\left( d_{- k}^{(n)} \right)}}{p\left( y \middle| \lambda_{2}^{e} \right)}} \end{matrix} & (22) \end{matrix}$

where P^(e)(d_(−k) ^((n))) is short-hand notation for P(d_(−k) ^((n))|λ₂ ^(e)), i.e., the probability of d_(−k)=d_(−k) ^((n)) given the available extrinsic information. Similarly,

$\begin{matrix} {{P\left( {{d_{k} = \left. {+ 1} \middle| y \right.},d_{- k}^{(n)},\lambda_{2}^{e}} \right)} = {\frac{{p\left( {\left. y \middle| d_{- k}^{(n)} \right.,{d_{k} = {+ 1}}} \right)}{P^{e}\left( {d_{k} = {+ 1}} \right)}}{p\left( {\left. y \middle| d_{- k}^{(n)} \right.,\lambda_{2}^{e}} \right)}.}} & (23) \end{matrix}$

Substituting (23), the dual of (23) with d_(k)=+1 replaced by d_(k)=−1, and (22) in (21),

$\begin{matrix} \begin{matrix} {{\lambda_{1}\left( d_{k} \right)} = {\ln {\frac{\sum\limits_{n = 1}^{N_{s}}{{p\left( {\left. y \middle| d_{- k}^{(n)} \right.,{d_{k} = {+ 1}}} \right)}{P^{e}\left( d_{- k}^{(n)} \right)}}}{\sum\limits_{n = 1}^{N_{s}}{{p\left( {\left. y \middle| d_{- k}^{(n)} \right.,{d_{k} = {- 1}}} \right)}{P^{e}\left( d_{- k}^{(n)} \right)}}} \cdot \frac{P^{e}\left( {d_{k} = {+ 1}} \right)}{P^{e}\left( {d_{k} = {- 1}} \right)}}}} \\ {= {{\ln \frac{\sum\limits_{n = 1}^{N_{s}}{{p\left( {\left. y \middle| d_{- k}^{(n)} \right.,{d_{k} = {+ 1}}} \right)}{P^{e}\left( d_{- k}^{(n)} \right)}}}{\sum\limits_{n = 1}^{N_{s}}{{p\left( {\left. y \middle| d_{- k}^{(n)} \right.,{d_{k} = {- 1}}} \right)}{P^{e}\left( d_{- k}^{(n)} \right)}}}} + {{\lambda_{2}^{e}\left( d_{k} \right)}.}}} \end{matrix} & (24) \end{matrix}$

Recalling that λ₁ ^(e)(d_(k))=λ₁(d_(k))−λ₂ ^(e)(d_(k)), from (24),

$\begin{matrix} {{\lambda_{1}^{e}\left( d_{k} \right)} = {\ln {\frac{\sum\limits_{n = 1}^{N_{s}}{{p\left( {{yd_{- k}^{(n)}},{d_{k} = {+ 1}}} \right)}{P^{e}\left( d_{- k}^{(n)} \right)}}}{\sum\limits_{n = 1}^{N_{s}}{{p\left( {{yd_{- k}^{(n)}},{d_{k} = {- 1}}} \right)}{P^{e}\left( d_{- k}^{(n)} \right)}}}.}}} & (25) \end{matrix}$

Considering the MCMC simulation in further detail, a Markov chain can be constructed based on the channel model (1) and the a posteriori probability P(d|y,λ₂ ^(e)). It can be shown that this Markov chain is an irreducible, aperiodic and reversible chain. It thus follows that, upon convergence of the chain, its stationary distribution matches that of P(d|y,λ₂ ^(e)). Hence, the method may include constructing a MCMC simulation whose states are determined by different selections of the data vector d=[d₁ d₂ . . . d_(K)]^(T). For example, in a system with three channels and binary data, the state assignments may be chosen as shown in TABLE 1. Each state transition occurs as a result of flipping one of the bits in d. The selection of a bit is random and has equal probability for all the bits in d. The probability of transition is based on the a posteriori probability P(d_(k)=+1|y,d_(−k),λ₂ ^(e)). In other words, the transition probability can be set to correspond to conditional channel data bit probabilities, for example based on a model of the communication channel. Considering the three channel example of TABLE 1, if the current state is s₀ and d₂ is chosen for examination, the next state will be either s₀ or s₂. The decision to remain in s₀ or move to s₂ is made according to the following rule. (i) Calculate the a posteriori probability p⁺=P(d₂=+1|y,d₁=−1,d₃=−1,λ₂ ^(e)(d₂)). Move to state s₂ with the probability p⁺, otherwise remain in state s₀.

TABLE 1 Exemplary State Assignments for a System of Three Binary Data Channels State d₃ d₂ d₁ s₀ −1 −1 −1 s₁ −1 −1 +1 s₂ −1 +1 −1 s₃ −1 +1 +1 s₄ +1 −1 −1 s₅ +1 −1 +1 s₆ +1 +1 −1 s₇ +1 +1 +1

FIG. 3 presents a transition graph of this Markov chain. Possible transition between the states are indicated by arrows. These arrows are called edges. Presence of an edge indicates possible transition with a non-zero probability. If the probability of transition from one state to another is zero, no edge will connect the two states.

Note that, as channel noise decreases, the probability of some transitions may diminish to zero and others may approach one. This means, in the absence of the channel noise, some of the edges will be absent, and thus most of the useful properties of the underlying Markov chain may disappear. A practical consequence of this is that the MCMC simulation may exhibit a modal behavior: tendency to stay in certain states for long periods of time, failing to provide a good sampling. Modal behavior may be observed in a MCMC simulator at high signal to noise ratio, for example above 8 dB, in a MIMO system with four transmit antennas and quadrature signaling. In this situation, the Markov chain may have a tendency to spend long periods of time in the same state, causing insufficient variation in the hypothetical channel data samples, in turn causing poor estimates of the channel data probabilities and log likelihood ratios.

This modal behavior can therefore be avoided by running the MCMC simulation as though the signal to noise ratio of the received signal is lower than the actual signal to noise ratio in order to ensure good statistical properties from the MCMC simulation. For example, the auxiliary distribution may be chosen to be a conditional channel data probability estimated at a low signal to noise ratio. Use of an auxiliary distribution corresponding to a low signal to noise ratio, for example below 8 dB, or more particularly below 5 dB, avoids modal behavior of the MCMC simulator helps to prevent this problem by providing more perturbation in the MCMC simulator. Estimation of the channel data probability for higher signal to noise ratio is accomplished by scaling the calculated bit probability distribution to account for the auxiliary distribution. In other words, the correct value of the noise variance is used in calculating the probabilities in (25). Computer simulations reveal that this approach performs well, especially in highly loaded cases when K>2N.

A few observations from FIG. 3 are in order; these generalizations would be understood by one of skill in the art to apply to a system with an arbitrary number of channels:

-   -   For an observed vector y and given extrinsic information vector         λ₂ ^(e), the a posteriori probabilities P(d_(k)=+1|y,d_(−k),λ₂         ^(e)) and P(d_(k)=−1|y,d_(−k),λ₂ ^(e)) and, hence, the elements         of the transition matrix for the Markov chain are fixed. This         implies that the Markov chain is homogeneous.     -   Any arbitrary pairs of states s_(i) and s_(j) are connected         through a sequence of edges. This means transition between any         arbitrary pairs of states s_(i) and s_(j) is possible. This in         turn implies that the multi-channel Markov chain is irreducible.     -   There is an edge connecting each state to itself. In other         words, for any s_(i), the probability of staying in the state is         non zero, i.e. π_(ii)>0. This implies that the multi-channel         Markov chain is aperiodic.

Since the multi-channel Markov chain is homogeneous, irreducible and aperiodic, it can be proven that it converges to a unique stationary distribution.

Note that the a posteriori probability P(d|y,λ₂ ^(e)) is the stationary distribution of the multi-channel Markov chain: the probability that the multi-channel Markov chain is in the state associated with d. It can be shown that P(d|y,λ₂ ^(e)) satisfies the reversibility rule, and thus, if the multi-channel Markov chain is run for sufficient number of iterations, it converges toward the desired distribution P(d|y|λ₂ ^(e)).

In accordance with an embodiment of the invention, each step of the MCMC simulation may begin with a random selection of one of the state variable, d_(k). The next state is then determined according to the procedure described above. In accordance with an alternate embodiment of the invention, the state variables may be scheduled such that they each get turn on a regular basis. For example, one possible version of Gibbs sampler for the multi-channel detector is summarized as follows:

Initialize  d^((−N_(b)))(randomly), for  n = −N_(b) + 1  to  N_(s) draw  sample  d₁^((n))  from  P(d₁d₂^((n − 1)), …  , d_(K)^((n − 1)), y, λ₂^(e)) draw  sample  d₂^((n))  from  P(d₂d₁^((n)), d₃^((n − 1)), …  , d_(K)^((n − 1)), y, λ₂^(e)) ⋮ draw  sample  d_(K)^((n))  from  P(d_(K)d₁^((n)), …  , d_(K − 1)^((n)), y, λ₂^(e))

In this routine d^((−N) ^(b) ⁾ is initialized randomly, optionally taking into account the a priori information λ₂ ^(e). The ‘for’ loop examines the state variables, d_(k)'s, in order, N_(b)+N_(s) times. The first N_(b) iterations of the loop, called burn-in period, allows the Markov chain to converge to near its stationary distribution. The samples used for LLR computations are those of the last N_(s) iterations.

Alternately, in accordance with another embodiment of the present invention, a number of Gibbs samplers can be run in parallel. This introduces parallelism in the detector implementation, which in turn allows drawing more Gibbs samples. Such an approach may prove useful when available processing speed is a practical limitation. Moreover, the samples drawn in successive iterations from a single Markov chain are correlated. In contrast, the parallel Gibbs samplers draw a pool of samples which are less correlated; generally only the samples that belong to the same Markov chain are correlated. Although the parallel Gibbs samplers may be inefficient if a large burn-in period, N_(b), is used, the parallel Gibbs samplers can also be run with no burn-in period at all, in accordance with yet another embodiment of the present invention. Therefore, the choice between single and parallel Markov chains is application dependent and even for a particular application this choice may vary as the details of the detector implementation vary as will occur to one of skill in the art in possession of this disclosure.

An alternate method for estimating channel data probabilities in a multi-channel communications system receiver is illustrated in FIG. 2 in accordance with an embodiment of the present invention. The method, indicated generally at 200, may include receiving 202 a multi-channel communications signal to form an observed signal. Various techniques for receiving a multi-channel communications signal are known in the art as discussed within, and including for example a down-converting receiver. Another step in the method may include forming 204 a multi-channel data probability estimate from the observed signal. For example, forming a channel data probability estimate may be performed by soft decision estimation in a multi-channel detector. The method may also include simulating 206 a channel data distribution according to an auxiliary distribution using a Markov chain Monte Carlo simulator. For example, simulating a channel data distribution may be performed as discussed above. As discussed above, the auxiliary distribution may correspond to a channel data distribution determined for a low signal to noise ratio, or the auxiliary distribution may be correspond to a uniform distribution.

A final step in the method may include refining 208 the multi-channel data probability estimate using the channel data distribution. For example, refining the multi-channel data probability estimate may be performed as discussed above. Refining the multi-channel data probability estimate may include exchanging extrinsic information with a forward error correction decoder as discussed further below.

As discussed above, reception of a multi-channel signal may involve exchanging information between a detector and a decoder. For example, FIG. 4 illustrates a multi-channel receiver, shown generally at 400, in accordance with an embodiment of the present invention, which includes a detector 402 and a decoder 404 in a turbo decoding loop. The detector provides a set of soft output sequences λ₁ (LLRs) 412 for the information sequences d₁(i), d₂(i), . . . , d_(K)(i), based on the observed input vector sequence y(i) 410 and the extrinsic information (a priori soft information) 418 from the previous iteration of the decoder. After subtracting the extrinsic information from the LLR output 412 of detector, the extrinsic information λ₁ ^(e) 414 (remaining information new to the decoder) is passed to the decoder for further processing. Similarly, the extrinsic information (soft input) to each FEC decoder is subtracted from the decoder output λ₂ 416 to generate the extrinsic information λ₂ ^(e) 418 before being fed back to the detector. Typically, the turbo decoding loop includes an interleaver 408 and deinterleaver 406 between the detector and decoder. Multiple iterations of exchanging extrinsic information between the detector and decoder may be used to refine estimates of the channel data. It has also been found experimentally that, performance may be enhanced by running the MCMC simulation at a signal to noise ratio below the estimated signal to noise ratio of the received signal and gradually increasing the signal to noise ratio used by the MCMC simulation as the detector and decoder iterate.

For d_(k)(i), λ₁(d_(k)(i)) is used to denote the soft output of SISO multi-channel detector, λ₂(d_(k)(i)) to denote the soft output of the FEC decoder, and λ₁ ^(e)(d_(k)(i)) and λ₂ ^(e)(d_(k)(i)) to denote the corresponding extrinsic information, respectively. Moreover, the vectors λ₂ ^(e)(i)=[λ₂ ^(e)(d₁(i))λ₂ ^(e)(d₂(i)) . . . λ₂ ^(e)(d_(K)(i))]^(T) and λ₁ ^(e)(k)=[λ₁ ^(e)(d_(k)(1))λ₁ ^(e)(d_(k)(2)) . . . λ₁ ^(e)(d_(k)(M))]^(T) are defined. Note that λ₂ ^(e)(i) denotes the extrinsic information of all channels at time slot i, while λ₁ ^(e)(k) denotes the extrinsic information of channel k across one data block.

When data symbols are binary, taking values of +1 and −1, each symbol information is quantified by the LLR of a transmitted “+1” and a transmitted “−1”, given the input information, i.e.,

$\begin{matrix} {{{\lambda_{1}\left( {d_{k}(i)} \right)} = {\ln \frac{\; {P\left( {{{d_{k}(i)} = {{+ 1}{y(i)}}},{\lambda_{2}^{e}(i)}} \right)}}{P\left( {{{d_{k}(i)} = {{- 1}{y(i)}}},{\lambda_{2}^{e}(i)}} \right)}}},{and}} & (2) \\ {{\lambda_{2}\left( {d_{k}(i)} \right)} = {\ln {\frac{\; {P\left( {{{d_{k}(i)} = {{+ 1}{\lambda_{1}^{e}(k)}}},{decoding}} \right)}}{P\left( {{{d_{k}(i)} = {{- 1}{\lambda_{1}^{e}(k)}}},{decoding}} \right)}.}}} & (3) \end{matrix}$

The L-values in (3) can be obtained, for example, by following a turbo decoding algorithm. The decoder may include, for example, a set of parallel channel decoders, one decoder for each channel, when forward error correction encoded for each channel is performed independently. Alternately, the decoder may include a number of channel decoders operating across multiple channels each. Various suitable decoders for use in this receiver will occur to one of skill in the art having possession of this disclosure. The data need not be limited to binary, as will be discussed further below.

Various implementations of a detector 402 will now be discussed in further detail. For example, FIG. 5 illustrates a detector in accordance with one embodiment of the present invention. The detector 402, may include a receiver 502, a Gibbs sampler circuit 504, and a channel data probability estimator 506. The receiver is configured to receive a multi-channel signal and output an observed signal 510. For example, the receiver may include a matched filter, such as a despreader or correlator for CDMA signals. The Gibbs sampler circuit is coupled to the receiver and accepts the observed signal. The Gibbs sampler is configured to generate stochastically selected channel data hypothesis. For example, channel data hypotheses may be selected based in part on the observed signal and a channel model using a MCMC simulator as discussed above. The channel data probability estimator 506 is coupled to the receiver 502 and the Gibbs sampler circuit 504, and is configured to estimate channel data probabilities 514 from the observed signal 510 and the stochastically selected channel data hypotheses 512. For example, in accordance with another embodiment of the present invention the channel data probability estimator may form the estimates of channel data probabilities by performing a scaled summation of conditional channel data probabilities, where the conditional channel data probabilities are conditioned on the observed signal and channel data samples and the extrinsic information provided by the decoder is taken into account as discussed above. Scaling may be performed by taking into account the auxiliary distribution selected.

In accordance with another embodiment of the present invention, the detector may also include a log likelihood estimator 508 coupled to the channel data probability estimator 506 and configured to estimate channel data log likelihood estimates 516 from the channel data probabilities 514.

As discussed above, the detector 402 provides several advantages over detectors disclosed in the prior art. In particular, the detector may provide more rapid convergence in the receiver than previously known iterative techniques. Additionally, it may be possible to provide a multi-channel MIMO system wherein the number of transmit antennas is greater than the number of receive antennas (a condition often referred to as “overloaded” due to the limited ability of prior art detectors to accommodate such a situation), or a multi-channel CDMA system wherein the number of users is greater than the spreading gain of the system.

Additional detail on certain detailed embodiments of the detector 402 will now be provided. In developing a circuit implementation of the detector, it is helpful to perform the processing in a log domain. By operating in the log domain, numerical stability is improved and lower precision may be used. This allows for smaller chip-size and very fast clock rates. The log-domain formulation also lends itself to a hardware architecture that involves primarily addition, subtraction, and compare operations. Moreover, pipelining can be introduced in the proposed architecture in straightforward manner. Although pipelining induces some delay in the Gibbs sampler loop, the impact of this delay on the behavior of the MCMC simulator has been found to be negligible.

Considering the general case where all the involved variables/constants in the channel model of (1) is written more explicitly as

y _(c) =A _(c) d _(c) +n _(c)  (1a)

where the subscript ‘c’ is to emphasize the variables are complex-valued. Here, for convenience of formulations that follow, it is assumed that A_(c) as N/2 rows and K/2 columns. This implies that, in the case of a MIMO system, there are K/2 transmit and N/2 receive antennas and, in the case of a CDMA system, there are K/2 channels with spreading codes of length N/2. Accordingly, d_(c) has a length of K/2 and y_(c) and n_(c) are of length N/2.

The realization of the detection algorithms is simplified by rearranging (1a) in terms of real and imaginary parts of the underlying variables and coefficients. Such rearrangement is straightforward and leads to the equation

$\begin{matrix} {\mspace{79mu} {{y = {{Ad} + n}}\mspace{79mu} {where}{{y = \begin{bmatrix} {\Re \left\{ y_{c,1} \right\}} \\ {\left\{ y_{c,1} \right\}} \\ \vdots \\ {\Re \left\{ y_{c,{N/2}} \right\}} \\ {\left\{ y_{c,{N/2}} \right\}} \end{bmatrix}},{A = \left\lbrack \begin{matrix} {{\Re \left\{ a_{c,1,1} \right\}}\mspace{31mu} - {\left\{ a_{c,1,1} \right\}}} & \ldots & {{\Re \left\{ a_{c,1,{K/2}} \right\}}\mspace{31mu} - {\left\{ a_{c,1,{K/2}} \right\}}} \\ {\left\{ a_{c,1,1} \right\} \mspace{31mu} \Re \left\{ a_{c,1,1} \right\}} & \; & {\; {\left\{ a_{c,1,{K/2}} \right\} \mspace{31mu} \Re \left\{ a_{c,1,{K/2}} \right\}}} \\ \vdots & \ddots & \vdots \\ {{\Re \left\{ a_{c,{N/2},1} \right\}}\mspace{31mu} - {\left\{ a_{c,{N/2},1} \right\}}} & \; & {{{\Re \left\{ a_{c,{N/2},{K/2}} \right\}}\mspace{31mu} - {\left\{ a_{c,{N/2},{K/2}} \right\}}}\;} \\ {\left\{ a_{c,{N/2},1} \right\} \mspace{31mu} \Re \left\{ a_{c,{N/2},1} \right\}} & \ldots & {\left\{ a_{c,{N/2},{K/2}} \right\} \mspace{31mu} \Re \left\{ a_{c,{N/2},{K/2}} \right\}} \end{matrix} \right\rbrack},{d = \begin{bmatrix} {\Re \left\{ d_{c,1} \right\}} \\ {\left\{ d_{c,1} \right\}} \\ \vdots \\ {\Re \left\{ d_{c,{K/2}} \right\}} \\ {\left\{ d_{c,{K/2}} \right\}} \end{bmatrix}},{n = \begin{bmatrix} {\Re \left\{ n_{c,1} \right\}} \\ {\left\{ n_{c,1} \right\}} \\ \vdots \\ {\Re \left\{ n_{c,{N/2}} \right\}} \\ {\left\{ n_{c,{N/2}} \right\}} \end{bmatrix}},}}} & \left( {2a} \right) \end{matrix}$

{•} and

{•} denote the real and imaginary parts of the arguments, a_(c,i,j) is the ij^(th) element of A_(c), and y_(c,i), d_(c,i) and n_(c,i) are the i^(th) elements of y, d and n, respectively. Note that when the elements of d_(c) are from an L×L quadrature amplitude modulated (QAM) constellation, the elements of d are from an L-ary pulse amplitude modulation (PAM) alphabet. Also note that with the sizes specified above, y and n will be vectors of length N, d is a vector of length K, and A will be an N-by-K matrix. Many alternative definitions of (2a) are also possible, including for example defining

$y = \begin{bmatrix} {\Re \left\{ y \right\}} \\ {\left\{ y \right\}} \end{bmatrix}$

and selecting A, d, and n accordingly.

The disclosed inventive techniques can also accommodate situations where the transmitted symbols are non-binary (e.g. QPSK modulation). This can be understood by the following derivation. First, define b as an information bit, and P(b=+1) and P(b=−1) as the probabilities of b being equal to +1 and −1, respectively. If L=2^(M), each element of d represents a set of M coded bits. Accordingly, d may be obtained through a mapping of a set of KM information bits b₁, b₂, . . . , b_(KM). Note that the LLR values associated with these bits, can be obtained from the conditional probability P(b_(k)=+1|y,λ₂ ^(e)), for k=1, 2, . . . , KM as discussed above. Here, λ₂ ^(e) is the set of a priori (extrinsic) information (the probabilities or LLR values) associated with information bits b₁, b₂, . . . , b_(KM) from the channel decoder. Define the vectors b=[b₁ b₂ . . . b_(KM)]^(T) and b_(−k)=[b₁ . . . b_(k−1) b_(k+1) . . . b_(KM)]^(T), and note that

$\begin{matrix} \begin{matrix} {{P\left( {{b_{k} = {{+ 1}y}},\lambda_{2}^{e}} \right)} = {\sum\limits_{b_{- k}}{P\left( {{b_{k} + 1},{b_{- k}y},\lambda_{2}^{e}} \right)}}} \\ {{= {\sum\limits_{b_{- k}}{{P\left( {{b_{k} = {{+ 1}y}},b_{- k},\lambda_{2}^{e}} \right)}{P\left( {{b_{- k}y},\lambda_{2}^{e}} \right)}}}},} \end{matrix} & \left( {4a} \right) \end{matrix}$

where the second identity follows by applying the chain rule, and the summation is over all possible values of b_(−k). As discussed above, the number of combinations that b_(−k) takes is equal to 2^(KM−1), and hence the Gibbs sampler is used as discussed above to select important samples. In accordance with one embodiment of the present invention, the Gibbs sampler may examine the successive elements of b and assign them random values such that the choices of b that result in small difference y−Ad are visited more frequently as discussed generally above.

In accordance with one embodiment of the present invention, to draw b_(k) ^((n)) in the Gibbs sampler, the distribution P(b_(k)|b₁ ^((n)), . . . , b_(k−1) ^((n)),b_(k+1) ^((n−1), . . . , b_(KM) ^((n−1),y,λ₂ ^(e)) is obtained, i.e., P(b_(k)=+1|b₁ ^((n)), . . . , b_(k−1) ^((n)),b_(k+1) ^((n−1)), . . . , b_(KM) ^((n−1)),y,λ₂ ^(e)) and P(b_(k)=−1|b₁ ^((n)), . . . , b_(k−1) ^((n)), b_(k+1) ^((n−1)), . . . , b_(KM) ^((n−1)),y,λ₂ ^(e)). To derive equations for these probabilities, define

$\begin{matrix} {b_{- k}^{(n)}\overset{\Delta}{=}\left\lbrack {{b_{1}^{(n)}\mspace{14mu} \ldots \mspace{14mu} b_{k - 1}^{(n)}b_{k + 1}^{({n - 1})}\mspace{14mu} \ldots}\mspace{14mu},b_{KM}^{({n - 1})}} \right\rbrack^{T}} & \left( {5a} \right) \end{matrix}$

and note that

$\begin{matrix} {{P\left( {{b_{k} = {{+ 1}y}},b_{- k}^{(n)},\lambda_{2}^{e}} \right)} = \frac{P\left( {{b_{k} = {{+ 1}y}},b_{- k}^{(n)},\lambda_{2}^{e}} \right)}{\begin{matrix} {{P\left( {{b_{k} = {1y}},b_{- k}^{(n)},\lambda_{2}^{e}} \right)} +} \\ {P\left( {{b_{k} = {{- 1}y}},b_{- k}^{(n)},\lambda_{2}^{e}} \right)} \end{matrix}}} & \left( {6a} \right) \end{matrix}$

since the summation in the denominator is equal to one. In (6a) and other equations that follow, b_(−k) ^((n)) is the short hand notation for b_(−k)=b_(−k) ^((n)). Note also that

$\begin{matrix} {{P\left( {{b_{k} = {{+ 1}y}},b_{- k}^{(n)},\lambda_{2}^{e}} \right)} = \frac{{p\left( {{yb_{k^{+}}^{(n)}},\lambda_{2}^{e}} \right)}{P\left( {b_{k^{+}}^{(n)}\lambda_{2}^{e}} \right)}}{p\left( {y,b_{- k}^{(n)},\lambda_{2}^{e}} \right)}} & \left( {7a} \right) \end{matrix}$

where b_(k) ₊ ^((n))=[b₁ ^((n)) . . . b_(k−1) ^((n)),+1,b_(k+1) ^((n−1)) . . . b_(KM) ^((n−1))]^(T). Also define b_(k) ₊ =[b₁ ^((n)) . . . b_(k−1) ^((n)),−1, b_(k+1) ^((n−1)) . . . b_(KM) ^((n−1))]^(T). Noting that p(y|b_(k) ₊ ^((n)),λ₂ ^(e))=p(y|b_(k) ₊ ^((n)), since when the data vector b is fully specified the extrinsic information become irrelevant, and substituting (7a) in (6a), after deleting the common terms,

$\begin{matrix} {{P\left( {{b_{k} = {{+ 1}y}},b_{- k}^{(n)},\lambda_{2}^{e}} \right)} = \frac{{p\left( {yb_{k^{+}}^{(n)}} \right)}{P^{e}\left( {b_{k} = {+ 1}} \right)}}{\begin{matrix} {{{p\left( {yb_{k^{+}}^{(n)}} \right)}{P^{e}\left( {b_{k} = {+ 1}} \right)}} +} \\ {{p\left( {yb_{k^{-}}^{(n)}} \right)}{P^{e}\left( {b_{k} = {- 1}} \right)}} \end{matrix}}} & \left( {8a} \right) \end{matrix}$

where P^(e)(b_(k)=i)ΔP(b_(k)=i|λ₂ ^(e)(b_(k))), for i=±1, and the elements of b can be assumed independent of each other, hence,

P(b _(k) ₊ ^((n))|λ₂ ^(e))=P ^(e)(b ₁ =b ₁ ^((n))) . . . P ^(e)(b _(k−1) =b _(k−1) ^((n)))P ^(e)(b _(k)=+1)P ^(e)(b _(k+1) =b _(k+1) ^((n−1))) . . . P ^(e)(b _(KM) =b _(KM) ^((n−1)).  (9a)

When A is known (or has been estimated) and the noise vector n is Gaussian and satisfies

${{E\left\lbrack {nn}^{H} \right\rbrack} = {\frac{1}{2}\sigma_{n}^{2}I}},$

$\begin{matrix} {{{p\left( {yb_{k^{+}}^{(n)}} \right)} = {\frac{1}{\left( {\pi\sigma}_{n}^{2} \right)^{N/2}}^{- {||{y - {Ad}_{k^{+}}^{(n)}}\mathop{\text{||}}^{2}{/\sigma_{n}^{2}}}}}},} & \left( {10a} \right) \end{matrix}$

where d_(k) ₊ ^((n)) is the vector of transmit symbols obtained through mapping from b_(k) ₊ ^((n)). Although direct substitution of (10a) and a similar equation with b_(k) ₊ ^((n)) replaced by b_(k) ⁻ ^((n)) in (8a) can be done, the result is computationally involved and may be sensitive to numerical errors procedure. Hence, a log-domain implementation is preferable as will now be described.

Defining

$\begin{matrix} {{\gamma_{k^{+}}\overset{\Delta}{=}{{\ln \left( {P^{e}\left( {b_{k} = {+ 1}} \right)} \right)} - \frac{\left. ||{y - {Ad}_{k^{+}}^{(n)}} \right.||^{2}}{\sigma_{n}^{2}}}}{and}} & \left( {11a} \right) \\ {\gamma_{k^{-}}\overset{\Delta}{=}{{\ln \left( {P^{e}\left( {b_{k} = {- 1}} \right)} \right)} - \frac{\left. ||{y - {Ad}_{k^{-}}^{(n)}} \right.||^{2}}{\sigma_{n}^{2}}}} & \left( {12a} \right) \end{matrix}$

(8a) may be rearranged as

$\begin{matrix} {{P\left( {{b_{k} = {{+ 1}y}},b_{- k}^{(n)},\lambda_{2}^{e}} \right)} = {\frac{1}{1 + ^{- {({\gamma_{k^{+}} - \gamma_{k^{-}}})}}}.}} & \left( {13a} \right) \end{matrix}$

Using (11a) and (12a), to obtain

$\begin{matrix} {{{\gamma_{k^{+}} - \gamma_{k^{-}}} = {{\lambda_{2}^{e}\left( b_{k} \right)} - {\frac{\left. ||{y - {Ad}_{k^{+}}^{(n)}}||{}_{2}{- \left. ||{y - {Ad}_{k^{-}}^{(n)}} \right.||^{2}} \right.}{\sigma_{n}^{2}}\mspace{14mu} {where}}}}{{\lambda_{2}^{e}\left( b_{k} \right)} = {\ln \; {\frac{P^{e}\left( {b_{k} = {+ 1}} \right)}{P^{e}\left( {b_{k} = {- 1}} \right)}.}}}} & \left( {14a} \right) \end{matrix}$

Noting that d_(k) ₊ ^((n)) and d_(k) ⁻ ^((n)) differ in one term, straightforward manipulations lead to

$\begin{matrix} {{\gamma_{k^{+}} - \gamma_{k^{-}}} = {{\lambda_{2}^{e}\left( b_{k} \right)} - {\frac{1}{\sigma_{n}^{2}}\left( {\left( d_{k^{+},p}^{(n)} \right)^{2} - \left( d_{k^{-},p}^{(n)} \right)^{2}} \right)r_{pp}} + {\frac{2}{\sigma_{n}^{2}}\left( {d_{k^{+},p}^{(n)} - d_{k^{-},p}^{(n)}} \right)\left( {y_{p}^{mf} - {\sum\limits_{{q = 1},{q \neq p}}^{K}{r_{pq}d_{q}^{(n)}}}} \right)}}} & \left( {15a} \right) \end{matrix}$

where y_(p) ^(mf)=a_(p) ^(T)y, r_(pq) is the pq th element of R=A^(T)A, d_(q) ^((n)) is the q th element of d^((n)), d_(k) ₊ _(,p) ^((n)) and d_(k) ⁻ _(,p) ^((n)) are the p th element of d_(k) ₊ ^((n)) and d_(k) ⁻ ^((n)), respectively, and b_(k) is mapped to d_(p) ^((n)). Note that d_(q) ^((n)), depends on b_(k) when q=p, and the above notation reflects this fact. Equation (15a) may be further rearranged as

$\begin{matrix} {{{\gamma_{k^{+}} - \gamma_{k^{-}}} = {{\lambda_{2}^{e}\left( b_{k} \right)} - {\kappa_{1}r_{pp}^{\prime}} + {\kappa_{2}\left( {y_{p}^{\prime {mf}} - {\sum\limits_{{q = 1},{q \neq p}}^{K}{r_{pq}^{\prime}d_{q}^{(n)}}}} \right)}}}{where}\begin{matrix} {{\kappa_{1} = {\frac{1}{2}\left( {\left( d_{k^{+},p}^{(n)} \right)^{2} - \left( d_{k^{-},p}^{(n)} \right)^{2}} \right)}},} \\ {{\kappa_{2} = {{\left( {d_{k^{+},p}^{(n)} - d_{k^{-},p}^{(n)}} \right)y_{p}^{\prime {mf}}} = {\frac{2}{\sigma_{n}^{2}}y_{p}^{mf}}}}\mspace{14mu} {and}} \\ {r_{pq}^{\prime} = {\frac{2}{\sigma_{n}^{2}}{r_{pq}.}}} \end{matrix}} & \left( {16a} \right) \end{matrix}$

Hence, y′_(p) ^(mf) and r′_(pq) can be pre-calculated prior to starting the Gibbs sampler and thus be provided as inputs to it.

When transmitted symbols are QPSK, d=b, d_(k) ₊ _(,p) ^((n))=+1 and d_(k) ⁻ _(,p) ^((n))=−1, and accordingly (16a) reduces to

$\begin{matrix} {{\gamma_{k^{+}} - \gamma_{k^{-}}} = {{\lambda_{2}^{e}\left( b_{k} \right)} + {2{\left( {y_{p}^{\prime {mf}} - {\sum\limits_{{q = 1},{q \neq p}}^{K}{r_{pq}^{\prime}b_{q}^{(n)}}}} \right).}}}} & \left( {17a} \right) \end{matrix}$

Moreover, since b_(q) ^((n))'s are binary, evaluation of the right-hand side of (17a) involves primarily additions and subtractions.

In the case of more complex modulations, such as QAM, evaluation of (16a) is naturally more involved. However, since d_(q) ^((n))'s are from a relatively small alphabet, an add/subtract implementation is still feasible as will be apparent to one of skill in the art having possession of this disclosure.

Evaluation of (13a) involves a function of the form 1/(1+e^(x)). Various approaches for implementing this function in hardware are possible, including using a lookup table or using the linear approximation:

$\begin{matrix} {\frac{1}{1 + ^{- x}} \approx {\frac{x}{2^{3}} + \frac{1}{2}}} & \left( {18a} \right) \end{matrix}$

When this approximation is used, it is possible that the evaluated value of P(b_(k)=+1|y,b_(−k) ^((n)),λ₂ ^(e)) exceeds one or becomes negative. When this happens, P(d_(k)=+1|y,b_(−k) ^((n)),λ₂ ^(e)) may be hard limited to the maximum and minimum values of 1 and 0, respectively.

Using (25) above,

$\begin{matrix} {\mspace{79mu} {{{\lambda_{1}^{e}\left( b_{k} \right)} = {\ln \frac{\sum\limits_{n = 1}^{N_{s}}{{p\left( {{yb_{- k}^{(n)}},{b_{k} = {+ 1}}} \right)}{P^{e}\left( b_{- k}^{(n)} \right)}}}{\sum\limits_{n = 1}^{N_{s}}{{p\left( {{yb_{- k}^{(n)}},{d_{k} = {- 1}}} \right)}{P^{e}\left( b_{- k}^{(n)} \right)}}}}}\mspace{79mu} {where}}} & \left( {19a} \right) \\ {{P^{e}\left( b_{- k}^{(n)} \right)} = {{P^{e}\left( {b_{1} = b_{1}^{(n)}} \right)}\mspace{14mu} \ldots \mspace{14mu} {P^{e}\left( {b_{k - 1} = b_{k - 1}^{(n)}} \right)}{P^{e}\left( {b_{k + 1} = b_{k + 1}^{({n - 1})}} \right)}\mspace{14mu} \ldots \mspace{14mu} {{P^{e}\left( {b_{KM} = b_{KM}^{({n - 1})}} \right)}.}}} & \left( {20a} \right) \end{matrix}$

To ensure that the samples b^((n)) are different, repetitions of b^((n)) may be deleted while running the Gibbs sampler. An efficient implementation can be developed by defining

$\begin{matrix} {{\eta_{k^{+}}^{(n)}\overset{\Delta}{=}{{\ln \; {P^{e}\left( b_{- k}^{(n)} \right)}} - \frac{{{y - {Ad}_{k^{+}}^{(n)}}}^{2}}{\sigma_{n}^{2}}}}{and}} & \left( {21a} \right) \\ {\eta_{k^{-}}^{(n)}\overset{\Delta}{=}{{\ln \; {P^{e}\left( b_{- k}^{(n)} \right)}} - \frac{{{y - {Ad}_{k^{-}}^{(n)}}}^{2}}{\sigma_{n}^{2}}}} & \left( {22a} \right) \end{matrix}$

and noting that (19a) can be rearranged as

$\begin{matrix} {{\lambda_{1}^{e}\left( b_{k} \right)} = {{\ln\left( {\sum\limits_{n = 1}^{N_{s}}^{\eta_{k^{+}}^{(n)}}} \right)} - {{\ln\left( {\sum\limits_{n = 1}^{N_{s}}^{\eta_{k^{-}}^{(n)}}} \right)}.}}} & \left( {23a} \right) \end{matrix}$

Additional simplification can be obtained using the definition

max*(x, y)=max(x, y)+ln(1+e ^(−|x−y|)), where max*(x, y)Δln(e ^(x) +e ^(y)),  (24a)

and its recursive extension

max*(x, y, z)=max*[max*(x, y), z], where max*(x, y, z)Δln(e ^(x) +e ^(y) +e ^(z)).  (25a)

Computation of ln(1+e^(−|x−y|)) may be done through the use of a small look-up table. Alternately, the approximation

$\begin{matrix} {{\lambda_{1}^{e}\left( b_{k} \right)} \approx {{\max\limits_{n}\eta_{k^{+}}^{(n)}} - {\max\limits_{n}{\eta_{k^{-}}^{(n)}.}}}} & \left( {26a} \right) \end{matrix}$

can be used. This approximation significantly simplifies the implementation of the detector. In (23a), each new sample of b is to be compared with the previous elements and deleted if it is a repeat sample. When N_(s) is large this may be a complexity burden. Implementation of (26a), in contrast, is relatively simple. As samples b are generated, the respective values η_(k) ₊ ^((n)) and η_(k) ⁻ ^((n)) are computed. Each of these are then compared their counterpart from the previous Gibbs samples, i.e., with η_(k) ₊ ^((n−1)) and η_(k) ⁻ ^((n−1)), respectively, and replaced if they are larger or discarded if they are smaller. This also avoids the need to search for repetitions of b; a significant savings since the number of comparisons needed for deleting repetitions grows with the square of N_(s).

An intermediate solution that also avoids the complexity burden of (23a), while still performing better than (26a) is to keep a handful largest samples of η_(k) ₊ ^((n)) and η_(k) ⁻ ^((n)) for application in an equation similar to (23a). Implementation of these results in circuit form will now be presented.

FIG. 6 illustrates a Gibbs sampler, in accordance with an embodiment of the present invention. The Gibbs sampler includes front-end processing 602. The front-end processing takes y, A and σ_(n) ² as inputs and calculates y′^(mf) and

$R^{\prime} = {\frac{2}{\sigma_{n}^{2}}{R.}}$

The channel response, A and noise variance σ_(n) ², may be known or may be estimated by the receiver using techniques known to one of skill in the art.

Substituting (16a) in (18a),

$\begin{matrix} {{P\left( {{b_{k} = {{+ 1}y}},b_{- k}^{(n)},\lambda_{2}^{e}} \right)} \approx {\frac{\begin{matrix} {{\lambda_{2}^{e}\left( b_{k} \right)} - {\kappa_{1}r_{pp}^{\prime}} +} \\ {\kappa_{2}\left( {y_{p}^{\prime {mf}} - {\sum\limits_{{q = 1},{q \neq p}}^{K}{r_{pq}^{\prime}d_{q}^{(n)}}}} \right)} \end{matrix}}{2^{3}} + {\frac{1}{2}.}}} & \left( {27a} \right) \end{matrix}$

In the Gibbs sampler 504, the next choice of b_(k) is made by selecting b_(k)=+1 with the probability P(b_(k)=+1|y,b_(−k) ^((n)),λ₂ ^(e)). To realize this in hardware, a random variable, v, with uniform distribution in the interval 0 to 1 may be generated, and b_(k) is set equal to +1 if P(b_(k)=+1|y,b_(−k) ^((n)),λ₂ ^(e))−v>0, otherwise b_(k) is set equal to −1. Alternatively, and more conveniently here, the latter inequality can be written as 2³(P(b_(k)=+1|y,b_(−k) ^((n)),λ₂ ^(e))−0.5)−u>0, where u=2³(v−0.5) is a random variable with uniform distribution in the interval −4 to +4. The random variable u can be easily generated using a linear feedback shift register (LFSR) circuit 628. Various LFSR circuits are known in the art.

The R′ register 604 stores a matrix of elements r′_(pq). The diagonal elements of R′ are forced to zero in order to exclude the case q=p as motivated by (27a). Since in practice d_(i)'s are from a small alphabet and accordingly the number of possible values of κ₁ and κ₂ are small, each multiplier 606, 612, 616 can optionally be implemented by add/subtract operations. Hence, the Gibbs sampler can be implemented in a multiplier-free realization. The rest of the operation of the Gibbs sampler thus follows from (27a).

Computation of L-values is done according to (21a), (22a) and (26a) by applying various approximations. Although, here, to simplify the discussion, use of (26a) is emphasized, the developed circuit, with minor modification as will occur to one of skill in the art, is also applicable to (23a).

From (21a) and (22a), note that the computation of κ_(k+) ^((n)) and η_(k−) ^((n)) requires computation of ln P^(e)(b_(−k) ^((n))) and

$\frac{{{y - {Ad}^{(n)}}}^{2}}{\sigma_{n}^{2}}.$

Continuing with the description of procedures for computation of these terms, note that

${\lambda_{2}^{e}\left( b_{k} \right)} = {{\ln \; \frac{P^{e}\left( {b_{k} = {+ 1}} \right)}{P^{e}\left( {b_{k} = {- 1}} \right)}} = {\ln \; \frac{P^{e}\left( {b_{k} = {+ 1}} \right)}{1 - {P^{e}\left( {b_{k} = {+ 1}} \right)}}}}$

and using this obtain, for i±1,

$\begin{matrix} \begin{matrix} {{\ln \; {P^{e}\left( {b_{k} = i} \right)}} = {\ln \; \frac{1}{1 + ^{- {{\lambda}_{2}^{e}{(b_{k})}}}}}} \\ {= {{- \max}*\left( {0,{{- i}\; {\lambda_{2}^{e}\left( b_{k} \right)}}} \right)}} \\ {\approx {- {\max \left( {0,{{- i}\; {\lambda_{2}^{e}\left( b_{k} \right)}}} \right)}}} \\ {= {{\min \left( {0,{i\; {\lambda_{2}^{e}\left( b_{k} \right)}}} \right)}.}} \end{matrix} & \left( {28a} \right) \end{matrix}$

Using (28a) and ψ_(k) ^((n)) as an approximation to ln P^(e)(b_(k) ^((n))), where b_(k) ^((n))=[b₁ ^((n)) . . . b_(k) ^((n)) b_(k+1) ^((n−1)) . . . b_(KM) ^((n−1))]^(T), and noting that because of the interleaving effect the information bits are independent,

$\begin{matrix} {\psi_{k}^{(n)} = {{\sum\limits_{l = 1}^{k}{\min \left( {0,{b_{l}^{(n)}{\lambda_{2}^{e}\left( b_{k} \right)}}} \right)}} + {\sum\limits_{l = {k + 1}}^{KM}{{\min \left( {0,{b_{l}^{({n - 1})}{\lambda_{2}^{e}\left( b_{k} \right)}}} \right)}.}}}} & \left( {29a} \right) \end{matrix}$

Using (29a), ψ_(k) ^((n)) can be updated according to the following rule:

if b _(k) ^((n)) ≠b _(k) ^((n−1)) then ψ_(k) ^((n))=ψ_(k) ^((n−1)) −b _(k) ^((n−1))λ₂ ^(e)(b _(k)) else ψ_(k) ^((n))=ψ_(k) ^((n−1)).

Note that ψ_(k) ^((n))=ψ_(k) ^((n−1)−min(0,b_(k) ^((n−1))λ₂ ^(e)(b_(k)))+min(0,b_(k) ^((n))λ₂ ^(e)(b_(k))), which can be simplified to

ψ_(k) ^((n))=ψ_(k) ^((n−1)) −b _(k) ^((n−1))λ₂ ^(e)(b _(k))  (29b)

when b_(k) ^((n))≠b_(k) ^((n−1)). Once ψ_(k) ^((n)) is available, ln P^(e)(b_(−k) ^((n))) can be calculated by removing the contribution of b_(k) ^((n)), viz.,

ln P ^(e)(b _(−k) ^((n)))=ψ_(k) ^((n))+max(0,b _(k) ^((n))λ₂ ^(e)(b _(k))).  (30a)

FIG. 7 illustrates a ψ-calculator circuit 700 based on the above result, in accordance with an embodiment of the present invention. When b_(k) ^((n))≠b_(k) ^((n−1)), the ψ register 702 is enabled and its content is updated according to (29b) using summer 704 for calculate the new value. Following (30a), ln P^(e)(b_(−k) ^((n))) is determined by the present content of ψ register, when b_(k) ^((n−1))λ₂ ^(e)(b_(k)) is positive, or by the updated ψ, when b_(k) ^((n−1))λ₂ ^(e)(b_(k)) is negative by selecting the appropriate resulting using a multiplexer 706 (or alternately, multiplexer 706 may be implemented by a switch) controlled by a sign bit extractor 708. Note that ψ is insensitive to a bias since the subtraction of the two terms on the right-hand side of (26a) (and also (23a)) removes such a bias. Hence, ψ can be assigned essentially any arbitrary initial value.

Next, a circuit for computation of

$\frac{{{y - {Ad}_{n^{+}}^{(n)}}}^{2}}{\sigma_{n}^{2}}\mspace{14mu} {and}\mspace{14mu} \frac{{{y - {Ad}_{k^{-}}^{(n)}}}^{2}}{\sigma_{n}^{2}}$

is described. Let

$\xi_{k^{+}}^{(n)} = {{\frac{{{y - {Ad}_{k^{+}}^{(n)}}}^{2}}{\sigma_{n}^{2}}\mspace{14mu} {and}\mspace{14mu} \xi_{k^{-}}^{(n)}} = \frac{{{y - {Ad}_{k^{-}}^{(n)}}}^{2}}{\sigma_{n}^{2}}}$

and note that the difference ξ_(k) ₊ ^((n))−ξ_(k) ⁻ ^((n))=δ is available from the Gibbs sampler. Accordingly, updating ξ_(k) ₊ ^((n)) and ξ_(k) ⁻ ^((n)) may be performed according to the rule:

if b_(k) ^((n)) ≠ b_(k) ^((n−1))   if b_(k) ^((n)) = +1     ξ_(k) ₊ ^((n)) = ξ + δ; ξ_(k) ⁻ ^((n)) = ξ; ξ = ξ + δ   else     ξ_(k) ₊ ^((n)) = ξ; ξ_(k) ⁻ ^((n)) = ξ − δ; ξ = ξ − δ else   if b_(k) ^((n)) = +1     ξ_(k) ₊ ^((n)) = ξ; ξ_(k) ⁻ ^((n)) = ξ − δ   else     ξ_(k) ₊ ^((n)) = ξ + δ; ξ_(k) ⁻ ^((n)) = ξ

Here, ξ is an auxiliary variable that helps with the implementation of the procedure. FIG. 8 illustrates ξ-calculator circuit to calculate ξ, in accordance with an embodiment of the present invention. The content of the ξ register 802 is updated whenever b_(k) ^((n))≠b_(k) ^((n−1)). It is updated to the value of ξ+δ (computed by adder 804) when b_(k) ^((n))=+1 and to the value of ξ−δ when b_(k) ^((n))=−1.

Finally, a log-likelihood calculator circuit for computing the LLR values is shown in FIG. 9 in accordance with an embodiment of the present invention. The log-likelihood calculator 900 uses the ξ-calculator circuit 800 and ψ-calculator circuit 700. The log-likelihood calculator implements (26a).

As shown above, one step of the Gibbs sampler uses one clock cycle. Hence one cycle of the Gibbs samplers use KM clock cycles to execute. In previously known MCMC simulation, the content of b is considered as a sample of the Markov chain at the end of each iteration of the Gibbs sampler. In contrast, here the transitional samples b_(k) ^((n))=[b₁ ^((n)) . . . b_(k) ^((n))b_(k+1) ^((n−1)) . . . b_(KM) ^((n−1))]^(T) are used. This modification reduces the hardware complexity and increases the speed of operation of the circuit. This modification appears to result in minor impact on the receiver performance.

As will occur to one of skill in the art, each of the above illustrated circuit may include pipelining to increase throughput. For example, a buffer can be placed after each adder. Similiary, the multipliers can also be implemented using a combination of adders and substractors, with pipelining. Accordingly, the clock rate of the circuit can be increased to a rate where one addition is performed each clock period. Of course, it will be recognized that additional delays may be used in order to time align various parameters. For example, the b values may be delayed in order to ensure they time-correspond to values of δ, which have longer pipeline delays in their computation.

A pipelined implementation will introduce a delay in the Gibbs sampler circuit, resulting in the Gibbs sampler drawing samples b_(k) ^((n)) from the distribution P(b_(k)|b₁ ^((n)), . . . , b_(k−Δ−1) ^((n)), . . . , b_(k−Δ) ^((n−1)), . . . , b_(k−1) ^((n−1)),b_(k+1) ^((n−1)), . . . , b_(KM) ^((n−1)),y,λ₂ ^(e)) rather than the initially discussed distribution P(b_(k)|b₁ ^((n)), . . . , b_(k−1) ^((n)),b_(k+1) ^((n−1)), . . . , b_(KM) ^((n−1)),y,λ₂ ^(e)). This does not appear to have an appreciate impact of the performance of the detector.

In summary, efficient hardware implementations of the detector using add, subtract and compare operations are illustrated. Such implementations are amenable to pipelining to increase the clock speed of operation. Additional benefits of the implementation are relatively small word lengths (e.g. 8-12 bit precision). Although the above has been described with particular reference to digital components, e.g. as implemented in an application specific integrated circuit or field programmable gate array, it is to be understood that the circuits can equally be implemented using a general purpose processor or digital signal processor.

Finally, it is noted that the mathematical derivation of operation of the presently disclosed inventive techniques made certain assumptions, e.g. Gaussian white noise and independent data. These assumptions are not essential to the operation of the disclosed embodiments, as excellent performance can be obtained in many situations which do not exactly fit these mathematical assumptions.

It is to be understood that the above-referenced arrangements are only illustrative of the application for the principles of the present invention. Numerous modifications and alternative arrangements can be devised without departing from the spirit and scope of the present invention. While the present invention has been shown in the drawings and fully described above with particularity and detail in connection with what is presently deemed to be the most practical and preferred embodiment(s) of the invention, it will be apparent to those of ordinary skill in the art that numerous modifications can be made without departing from the principles and concepts of the invention as set forth herein. 

1.-15. (canceled)
 16. A detector for estimating channel data probabilities in a multi-channel communication system comprising: a receiver configured to receive a multi-channel signal and output an observed signal; a Gibbs sampler circuit coupled to the receiver and configured to generate stochastically selected channel data hypotheses based in part on the observed signal and a channel model; and a channel data probability estimator coupled to the receiver and coupled to the Gibbs sampler circuit and configured to estimate channel data probabilities from conditional data probabilities conditioned on the observed signal and the stochastically selected channel data hypotheses.
 17. The detector of claim 16, wherein the Gibbs sampler circuit further comprises a Markov chain Monte Carlo simulator coupled to the receiver and configured to generate channel data samples from an auxiliary distribution wherein transition probabilities are based in part on the observed signal.
 18. The detector of claim 17 wherein the auxiliary distribution is a uniform distribution.
 19. The detector of claim 17 wherein the auxiliary distribution is based on the channel model using a signal to noise ratio below an estimated operating signal to noise ratio of the multi-channel communication system.
 20. The detector of claim 16 wherein the channel data probability estimator further comprises a log likelihood ratio estimator coupled to the channel data probability estimator and configured to estimate channel data log likelihood ratios from the channel data probabilities.
 21. The detector of claim 16 further comprising a decoder coupled to the channel data probability estimator and configured to exchange extrinsic information with the channel data probability estimator.
 22. A method for estimating channel data likelihoods in a multi-channel communications system receiver comprising: receiving a multi-channel communications signal to form an observed signal; generating stochastically-selected channel data hypotheses using a Markov chain Monte Carlo simulation; determining conditional bit probabilities conditioned on the stochastically-selected channel data hypotheses and the observed signal; and forming a channel data likelihood based on the conditional bit probabilities.
 23. The method of claim 22, wherein forming a channel data likelihood comprises: summing the conditional bit probabilities to form channel data bit probabilities corresponding to each possible value for a channel data bit; and determining a log likelihood ratio for the channel data bit using the channel data bit probabilities.
 24. The method of claim 22, wherein forming a channel data likelihood comprises: finding a maximum conditional bit probability for each possible value of a channel data bit; and approximating a log likelihood ratio for the channel data bit using the maximum conditional bit probability for each possible value of the channel data bit.
 25. The method of claim 22, wherein generating stochastically-selected channel data hypotheses using a Markov chain Monte Carlo simulation comprises setting state transaction probabilities for the Markov chain Monte Carlo simulation based on the observed signal.
 26. The method of claim 22, wherein generating stochastically-selected channel data hypotheses using a Markov chain Monte Carlo simulation comprises setting state transaction probabilities based on an auxiliary distribution. 